Effects of Multiplicity in Arrival Processes on Queue Lengths and Waiting Times
نویسنده
چکیده
This paper treats of some queueing systems with multiple inputs and exponential service times with a common rate r. The queue discipline for all systems in this paper is first-come, first-served. The systems of equations for steady-state probabilities of queueing systems are of the similar forms and hence the methods for solving these systems are also similar to each other. Under the steady-state condition the relations between the state probability distribution at arrival epoch of a type-1 customer and that of a type-2 c'ustomer are investigated.
منابع مشابه
Second Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملAnalysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths
This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH -distributions. A GI /M /1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distri...
متن کاملTail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
We consider the problem of estimating tail probabilities of waiting times in statistical multiplexing systems with two classes of sources { one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian Arrival Proc...
متن کاملA polling model with smart customers
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this model we study the joint queue length distribution at polling epochs and departure epochs. We also study the marginal queue length distribution at arrival ep...
متن کاملQueue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials
We consider a Markovian multiserver queueing model with time dependent parameters where waiting customers may abandon and subsequently retry. We provide simple uid and di usion approximations to estimate the mean, variance, and density for both the queue length and virtual waiting time processes arising in this model. These approximations, which are generated by numerically integrating only 7 o...
متن کامل